Bibtex of Geometry / Spanning tree

@article{Avis1996, 
     author = "Avis, David and Fukuda, Komei", 
     doi = "10.1016/0166-218X(95)00026-N", 
     issn = "0166218X", 
     journal = "Discrete Applied Mathematics", 
     link = "http://linkinghub.elsevier.com/retrieve/pii/0166218X9500026N", 
     month = "mar", 
     number = "1-3", 
     pages = "21--46", 
     title = "Reverse search for enumeration", 
     uri = "http://linkinghub.elsevier.com/retrieve/pii/0166218X9500026N", 
     volume = "65", 
     year = "1996", 
}

@article{Eppstein1992, 
     author = "Eppstein, David", 
     doi = "10.1007/BF01994879", 
     issn = "00063835", 
     journal = "BIT", 
     keyword = "F.1.3,F.2.2,G.2.2,I.2.8", 
     link = "http://link.springer.com/10.1007/BF01994879", 
     month = "jun", 
     number = "2", 
     pages = "237--248", 
     title = "Finding the k smallest spanning trees", 
     uri = "http://link.springer.com/10.1007/BF01994879", 
     volume = "32", 
     year = "1992", 
}

@article{Eppstein1997, 
     author = "Eppstein, David and Galil, Zvi and Italiano, Giuseppe F. and Nissenzweig, Amnon", 
     doi = "10.1145/265910.265914", 
     issn = "00045411", 
     journal = "Journal of the ACM", 
     keyword = "dynamic graph algorithms,edge and vertex connectivity,minimum spanning trees", 
     link = "http://dl.acm.org/citation.cfm?id=265910.265914", 
     month = "sep", 
     number = "5", 
     pages = "669--696", 
     publisher = "ACM", 
     title = "Sparsification---A Technique for Speeding Up Dynamic Graph Algorithms", 
     uri = "http://dl.acm.org/citation.cfm?id=265910.265914", 
     volume = "44", 
     year = "1997", 
}